| 1. | This maximum degree of enrichment for any one distillation step is said to represent one theoretical plate .
对于任意一个蒸馏步骤，就称此最大浓度相当于一个理论板。 |
| 2. | The strong chromatic index of graphs with maximum degree
最大度等于5的图的强边色数 |
| 3. | The maximum degree of parallelism is configured just like parallel queries
最大并行度的配置与配置并行查询相同。 |
| 4. | Target threat evaluating and sequencing method based on the maximum degree of membership
基于模糊多属性决策的威胁度评估与排序研究 |
| 5. | The maximum degree of parallelism is configured just like that of parallel queries
最大并行度的配置就像并行查询的最大并行度一样。 |
| 6. | The maximum degree of parallelism is configured in the same manner as that of parallel queries
并行度由查询处理器自动确定。最大并行度的配置方式与并行查询相同。 |
| 7. | The max degree option on dsntip4 determines the maximum degree of parallelism maximum number of parallel tasks
Dsntip4上的max degree选项决定了最大并行度（并行任务的最大数量） 。 |
| 8. | ( 2 ) if the maximum degree of any pair of nonadjacent vertices is at least , then g can be partitioned into k subgraphs hi which hi is a cycle or a path ( 1 i k )
（ 1 ）如果任何一对不相邻顶点的度和至少为n k ，则g能被剖分成k个子图从（二三卜k ） ，其中从是圈或路 |
| 9. | A color a e x is legal for an uncolored vertex v e v if by coloring v with a , the subgraph induced by all vertices of color a has maximum degree at most d
对顶点v是合法的，是指由所有染颜色。的顶点导出的子图的最大度至多是d ，其中alice和bob每走一步都是用合法颜色染未染色点。 |
| 10. | We prove that halin graphs , 1 - trees and outerplanar graphs satisfy the conjecture presented by n . alon that the acyclic edge chromatic number of any graph does not exceed its maximum degree plus 2
证明了halin图、 1 -树和外平面图满足由n . alon提出的任何一个图的无圈边色数不超过其最大度加2的猜想。 |
